Solving equations and optimization problems with uncertainty

We study the problem of detecting zeros of continuous functions that are known only up to an error bound, extending the theoretical work of [FK15b] with explicit algorithms and experiments with an implementation. More formally, the robustness of zero of a continuous map f : X → R is the maximal r > 0 such that each g : X → R with ‖f − g‖∞ ≤ r has a zero. We develop and implement an algorithm approximating the robustness of zero. Further, we show how to use the algorithm for approximating worst-case optima in optimization problems in which the feasible domain is defined by the zero set of a function f : X → R which is only known approximately. An important ingredient is an algorithm for deciding the topological extension problem based on computing cohomological obstructions to extendability and their persistence. We describe an explicit algorithm for the primary and secondary obstruction, two stages of a sequence of algorithms with increasing complexity. We provide experimental evidence that for random Gaussian fields, the primary obstruction—a much less computationally demanding test than the secondary obstruction—is typically sufficient for approximating robustness of zero.